rest point
Stable variation in multidimensional competition
The Fundamental Theorem of Language Change (Yang, 2000) implies the impossibility of stable variation in the Variational Learning framework, but only in the special case where two, and not more, grammatical variants compete. Introducing the notion of an advantage matrix, I generalize Variational Learning to situations where the learner receives input generated by more than two grammars, and show that diachronically stable variation is an intrinsic feature of several types of such multiple-grammar systems. This invites experimentalists to take the possibility of stable variation seriously and identifies one possible place where to look for it: situations of complex language contact.
Replicator Dynamics of Coevolving Networks
Galstyan, Aram (University of Southern California) | Kianercy, Ardeshir (University of Southern California) | Allahverdyan, Armen (Yerevan Physics Institute)
We propose a simple model of network co-evolution in a game-dynamical system of interacting agents that play repeated games with their neighbors, and adapt their behaviors and network links based on the outcome of those games. The adaptation is achieved through a simple reinforcement learning scheme. We show that the collective evolution of such a system can be described by appropriately defined replicator dynamics equations. In particular, we suggest an appropriate factorization of the agents strategies thats results in a coupled system of equations characterizing the evolution of both strategies and network structure, and illustrate the framework on two simple examples.